Gridlock resolution in a GPU-accelerated traffic queue model
نویسندگان
چکیده
منابع مشابه
Traffic gridlock on a honeycomb city.
Inspired by an old and almost in oblivion urban plan, we report the behavior of the Biham-Middleton-Levine (BML) model-a paradigm for studying phase transitions of traffic flow-on a hypothetical city with a perfect honeycomb street network. In contrast with the original BML model on a square lattice, the same model on a honeycomb does not show any anisotropy or intermediate states, but a single...
متن کاملToward GPU-accelerated traffic simulation and its real-time challenge
Traffic simulation is a growing domain of computational physics. Many life and industrial applications would benefit from traffic simulation to establish reliable transportation systems. A core challenge of this science research, however, is its unbounded scale of computation. This paper explores an advantage of using the graphics processing unit (GPU) for this computational challenge. We study...
متن کاملParallel Queue Model Approach to Traffic Microsimulations
In this paper, we explain a parallel implementation of a traffic micro-simulation model based on the queue model by Gawron. Within this model, links do not only have a flow capacity that limits the number of vehicles that can leave the link, but also have a space constraint which limits the number of vehicles that can be on a link simultaneously. The vehicles in this model follow their precompu...
متن کاملDiVinE-CUDA - A Tool for GPU Accelerated LTL Model Checking
In this paper we present a tool that performs CUDA accelerated LTL Model Checking. The tool exploits parallel algorithm MAP adjusted to the NVIDIA CUDA architecture in order to efficiently detect the presence of accepting cycles in a directed graph. Accepting cycle detection is the core algorithmic procedure in automata-based LTL Model Checking. We demonstrate that the tool outperforms non-acce...
متن کاملGPU Accelerated Counterexample Generation in LTL Model Checking
Strongly Connected Component (SCC) based searching is one of the most popular LTL model checking algorithms. When the SCCs are huge, the counterexample generation process can be time-consuming, especially when dealing with fairness assumptions. In this work, we propose a GPU accelerated counterexample generation algorithm, which improves the performance by parallelizing the Breadth First Search...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2020
ISSN: 1877-0509
DOI: 10.1016/j.procs.2020.03.171